Enhanced Marine Predators Algorithm for Solving Global Optimization and Feature Selection Problems
نویسندگان
چکیده
Feature selection (FS) is applied to reduce data dimensions while retaining much information. Many optimization methods have been enhance the efficiency of FS algorithms. These approaches processing time and improve accuracy learning models. In this paper, a developed method called MPAO based on marine predators algorithm (MPA) “narrowed exploration” strategy Aquila optimizer (AO) proposed handle FS, global optimization, engineering problems. This modification enhances exploration behavior MPA update explore search space. Therefore, narrowed AO increases searchability MPA, thereby improving its ability obtain optimal or near-optimal results, which effectively helps original overcome local optima issues in problem domain. The performance evaluated solving problems using some evaluation criteria, including maximum value (Max), minimum (Min), standard deviation (Std) fitness function. Furthermore, results are compared meta-heuristic over four Experimental confirm
منابع مشابه
FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملA Parallel Global Optimization Algorithm for Solving Inverse Problems
In this paper two improved versions of Genetic Clustering (GC) algorithm [1] are described. GC is a parallel global optimization algorithm that was designed in order to solve such parameter inverse problems in which an approximation of certain level sets (central parts of basins of attractions of local minimizers) is required. The approximation of these sets can be useful when some additional c...
متن کاملAn algorithm of global optimization for solving layout problems
The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the arti®cial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented ®rst time. The method given here can be extended to solve oth...
متن کاملHybrid Evolutionary Algorithm for Solving Global Optimization Problems
Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ranked as one of the best search algorithm for solving global optimization problems in several case studies. This paper presents a simple and modified hybridized Differential Evolution algorithm for solving global optimizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10214154